Papers with task-specific adaptation

6 papers
RECIPE-TKG: From Sparse History to Structured Reasoning for LLM-based Temporal Knowledge Graph Completion (2026.eacl-long)

Copied to clipboard

Challenge: Temporal Knowledge Graphs (TKGs) represent dynamic facts as timestamped relations between entities. Large Language Models (LLMs) have sparked interest in using pretrained generative models for TKG completion.
Approach: They propose a framework that allows for rule-based multi-hop sampling and contrastive fine-tuning to shape relational compatibility.
Outcome: Experiments show that RECIPE-TKG outperforms prior LLM-based methods across input regimes.
AdaptFlow: Adaptive Workflow Optimization via Meta-Learning (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to large language models rely on static templates or manual workflows.
Approach: AdaptFlow is a language-based meta-learning framework inspired by model-agnostic meta- learning.
Outcome: AdaptFlow outperforms manual and automated workflows on question answering, code generation and mathematical reasoning benchmarks.
Two Streams, One Sarcasm: Orthogonal Expert Tuning for Holistic Multimodal Sarcasm Understanding (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks for multimodal satirical cognition hinder evaluation of multimodal Sarcasm Understanding . lack of a unified benchmark for holistic satire cognition hampers evaluation of MSU .
Approach: They propose a framework to decouple experts into orthogonal shared perception and private execution streams to physically block gradient interference between tasks.
Outcome: The proposed framework achieves superior performance on DocMSU-PLUS.
Rethinking Model Selection and Decoding for Keyphrase Generation with Pre-trained Sequence-to-Sequence Models (2023.emnlp-main)

Copied to clipboard

Challenge: Keyphrase generation is a longstanding task in NLP with widespread applications.
Approach: They propose a likelihood-based decode-select algorithm for seq2seq PLMs that improves greedy search by an average of 4.7% semantic F1 across five datasets.
Outcome: The proposed algorithm improves greedy search by an average of 4.7% semantic F1 across five datasets.
RECALL: REpresentation-aligned Catastrophic-forgetting ALLeviation via Hierarchical Model Merging (2025.emnlp-main)

Copied to clipboard

Challenge: Existing models that require task labels or performance trade-offs are susceptible to catastrophic forgetting.
Approach: They propose a representation-aware model merging framework for continual learning without access to historical data.
Outcome: The proposed framework outperforms baselines in knowledge retention and generalization across five NLP tasks and multiple continual learning scenarios.
RanLoRA: Residual-aware Nonlinear Low-Rank Adaptation (2026.findings-acl)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) relying on linear low-rank projections restricts adaptation to linear subspaces, limiting flexibility on complex downstream tasks.
Approach: They propose a nonlinear low-rank Adaptation approach that leverages pretrained weights to decompose them into principal components that are kept frozen and residual components that can be used for task-specific adaptation.
Outcome: The proposed approach outperforms vanilla LoRA and representative variants on commonsense reasoning, image classification, and mathematical reasoning tasks.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations